Trellis Properties of Product Codes
نویسندگان
چکیده
In this paper, we study trellis properties of the tensor product (product code) of two linear codes, and prove that the tensor product of the lexicographically first bases for two linear codes in minimal span form is exactly the lexicographically first basis for their product code in minimal span form, also the tensor products of characteristic generators of two linear codes are the characteristic generators of their product code. key words: tensor product, trellis, minimal span form, characteristic generator
منابع مشابه
On the Intractability of Permuting a Block Code to Minimize Trellis Complexity [Correspondence] - Information Theory, IEEE Transactions on
A novel trellis design technique for both block and convolutional codes based on the Shannon product of component block codes is introduced. Using the proposed technique, structured trellises for block and convolutional codes have been designed. It is shown that the designed trellises are minimal and allow reduced complexity Viterbi decoding. Zndex Terms-Linear codes, trellis structure, product...
متن کاملTrellis-constrained Codes
We introduce a class of iteratively decodable trellis-constrained codes as a generalization of turbocodes, low-density parity-check codes, serially-concatenated con-volutional codes, and product codes. In a trellis-constrained code, multiple trellises interact to deene the allowed set of codewords. As a result of these interactions, the minimum-complexity single trellis for the code can have a ...
متن کاملThe trellis complexity of convolutional codes
It has long been known that convolutional codes have a natural, regular trellis structure that facilitates the implementation of Viterbi's algorithm [30,10]. It has gradually become apparent that linear block codes also/]ave a natural, though not in general a regular, "minimal" trellis structure, which allows them to be decoded with a Viterbi-1ike algorithn] [2,31,22,11,27,14,12,16,24,25,8,15]....
متن کاملOn the Trellis Structure of Block Codes - Information Theory, IEEE Transactions on
Abst+act-The problem of minimizing the vertex count at a given time index in the trellis for a general (nonlinear) code is shown to be NP-complete. Examples are provided that show that 1) the minimal trellis for a nonlinear code may not be observable, i.e., some codewords may be represented by more than one path through the trellis and 2) minimizing the vertex count at one time index may be inc...
متن کاملTail-biting Trellises for Linear Codes and their Duals
Trellis representations of linear block codes are attractive because of their use in soft decision decoding algorithms. An interesting property that is known for conventional trellises is that the minimal conventional trellis (known to be unique) for a linear block code, and its dual have the same state-complexity profile. This interesting property follows from the BCJR construction [1] of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 88-A شماره
صفحات -
تاریخ انتشار 2005